Minimizing the maximum flow time in batch scheduling
نویسندگان
چکیده
منابع مشابه
Minimizing the maximum flow time in batch scheduling
We consider the maximum flow time minimization problem in batch scheduling, which is a capacitated version of broadcast scheduling. In this setting, n different pages of information are available at the server which receives requests from clients over time for specific pages. The server can transmit atmost one page p at each time to satisfy a batch of requests for the same page p, up to a certa...
متن کاملBatch Scheduling in Flexible Flow Shop
In this paper, the problem of batch scheduling in a flexible flow shop environment is studied. It is assumed that machines in some stages are able to process a number of jobs simultaneously. The applications of this problem can be found in various industries including spring and wire manufacturing and in auto industry. A mixed integer programming formulation of the problem is presented and it i...
متن کاملBatch Scheduling in Flexible Flow Shop
In this paper, the problem of batch scheduling in a flexible flow shop environment is studied. It is assumed that machines in some stages are able to process a number of jobs simultaneously. The applications of this problem can be found in various industries including spring and wire manufacturing and in auto industry. A mixed integer programming formulation of the problem is presented and it i...
متن کاملMinimizing Maximum Flow-time on Related Machines
We consider the online problem of minimizing the maximum flow-time on related machines. This is a natural generalization of the extensively studied makespan minimization problem to the setting where jobs arrive over time. Interestingly, natural algorithms such as Greedy or Slow-fit that work for the simpler identical machines case or for makespan minimization on related machines, are not O(1)-c...
متن کاملOnline Broadcast Scheduling: Minimizing the Maximum Response Time
Broadcast scheduling is a widely used mechanism for disseminating vast amounts of information. In this model, information is discretized into “pages”, which clients explicitly request. The primary advantage of broadcasting is that any number of outstanding requests may be satisfied via only one broadcast. There are several ways to measure the quality of a schedule. The majority of this paper is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2016
ISSN: 0167-6377
DOI: 10.1016/j.orl.2016.09.016